A scaling limit for the length of the longest cycle in a sparse random digraph

We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

广西经济增长、金融发展与城乡收入差距的实证研究

探讨了经济增长及金融发展与城乡收入差距之间互动影响,刻画了三者间的逻辑关系,并基于广西1990-2017年的统计数据,运用状态空间模型及卡尔曼滤波算法对三者间动态关系进行了实证分析.结果显示:经济增长对城乡收入差距呈现倒U型曲线形态,而金融发展则显示出具有不断缩小城乡收入差距的趋势.     

Homogeneous variable exponent Besov and Triebel–Lizorkin spaces

We introduce homogeneous Besov and Triebel–Lizorkin spaces with variable indexes. We show that their study reduces to the study of inhomogeneous variable exponent spaces and homogeneous constant exponent spaces. Corollaries include trace space characterizations and Sobolev embeddings.     

On the domain of fractional Laplacians and related generators of Feller processes

In this paper we study the domain of the generator of stable processes, stable-like processes and more general pseudo- and integro-differential operators which naturally arise both in analysis and as infinitesimal generators of Lévy- and Lévy-type (Feller) processes. In particular we obtain conditions on the symbol of the operator ensuring that certain (variable order) Hölder and Hölder–Zygmund spaces are in the domain. We use tools from probability theory to investigate the small-time asymptotics of the generalized moments of a Lévy or Lévy-type process ${(X_t)}_{t\ge 0}$,

$\underset{t\to 0}{\lim }?\frac{1}{t}({\mathbb{E}}^{x}f(X_t)?f(x)),x\in {\mathbb{R}}^d,$

for functions f which are not necessarily bounded or differentiable. The pointwise limit exists for fixed $x\in {\mathbb{R}}^d$ if f satisfies a Hölder condition at x. Moreover, we give sufficient conditions which ensure that the limit exists uniformly in the space of continuous functions vanishing at infinity. As an application we prove that the domain of the generator of ${(X_t)}_{t\ge 0}$ contains certain Hölder spaces of variable order. Our results apply, in particular, to stable-like processes, relativistic stable-like processes, solutions of Lévy-driven SDEs and Lévy processes.     

NIFTy 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters

NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .     

Weighted estimates for the multilinear maximal function on the upper half‐spaces

For a general dyadic grid, we give a Calderón–Zygmund type decomposition, which is the principle fact about the multilinear maximal function on the upper half‐spaces. Using the decomposition, we study the boundedness of . We obtain a natural extension to the multilinear setting of Muckenhoupt's weak‐type characterization. We also partially obtain characterizations of Muckenhoupt's strong‐type inequalities with one weight. Assuming the reverse Hölder's condition, we get a multilinear analogue of Sawyer's two weight theorem. Moreover, we also get Hytönen–Pérez type weighted estimates.